A comparative study analysis of materialized view for selection cost
نویسندگان
چکیده
منابع مشابه
A Comparative Study Analysis of Materialized View for Selection Cost
Materialized view selection is one of the most crucial techniques to design data warehouse in an optimal manner. Selecting views to materialize for the purpose of supporting the decision making efficiently is one of the most significant decisions in designing Data Warehouse. Selecting a set of derived views to materialize which minimizes the sum of total query response time and maintenance of t...
متن کاملapplying transitivity theory to gender analysis of efl textbook: : a comparative study.
efl/esl textbooks have been regarded as essential language teaching materials with which the learners spend about 70 up to 90 percent of their class time. the important role they play and their vast use make them not only influential in learning the language but also in shaping values and attitudes. put it another way, textbooks socialize learners using their contents (i.e. texts, illustrations...
15 صفحه اولMaterialized View Selection: A Survey
This is a draft of my contribution to a book chapter (doi: 10.4018/978-1-60566-816-1.ch005). We mainly categorize and review the existing approaches to materialized view selection. View selection addresses the problem of choosing materialized views in the design process of data warehouses. Informally, it can be stated as, given an estimated query workload and possibly also sets of candidate vie...
متن کاملAn Improved Algorithm for Materialized View Selection
The data warehouse is subject oriented, integrated, nonvolatile and time-varying data sets, which is used to support management decision-making. A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing Decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materializ...
متن کاملMaterialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hierarchies. However, the problem of what to precompute is difficult and intriguing. The leading existing algorithm, BPUS, has a running time that is polynomial in the number of views and is guaranteed to be within (0.63...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science & Engineering Survey
سال: 2012
ISSN: 0976-3252
DOI: 10.5121/ijcses.2012.3102